Sweepouts of amalgamated 3–manifolds

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sweepouts of amalgamated 3–manifolds

To this end let X and Y be 3–manifolds with incompressible boundary homeomorphic to a connected surface F . It is not difficult to show that if HX and HY are Heegaard surfaces in X and Y then we can amalgamate these splittings to obtain a Heegaard surface in X∪F Y with genus equal to g(HX)+g(HY )−g(F) (see, for example, Schultens [14]). Letting g(X), g(Y), and g(X∪F Y) denote the minimal genus ...

متن کامل

2 00 5 Sweepouts of Amalgamated 3 - Manifolds

We show that if two 3-manifolds with toroidal boundary are glued via a “sufficiently complicated” map then every Heegaard splitting of the resulting 3-manifold is weakly reducible. Additionally, suppose X∪F Y is a manifold obtained by gluing X and Y , two connected small manifolds with incompressible boundary, along a closed surface F . Then the following inequality on genera is obtained:

متن کامل

Min-max for Sweepouts by Curves

Given a Riemannian metric on the 2-sphere, sweep the 2-sphere out by a continuous oneparameter family of closed curves starting and ending at point curves. Pull the sweepout tight by, in a continuous way, pulling each curve as tight as possible yet preserving the sweepout. We show the following useful property (see Theorem 1.9 below); cf. [CM1], [CM2], proposition 3.1 of [CD], proposition 3.1 o...

متن کامل

Amalgamated Lock-Elision

Hardware lock-elision (HLE) introduces concurrency into legacy lockbased code by optimistically executing critical sections in a fast-path as hardware transactions. Its main limitation is that in case of repeated aborts, it reverts to a fallback-path that acquires a serial lock. This fallback-path lacks hardwaresoftware concurrency, because all fast-path hardware transactions abort and wait for...

متن کامل

Multi-amalgamated Triple Graph Grammars

Triple Graph Grammars (TGGs) are a well-known technique for rule-based specification of bidirectional model transformation. TGG rules build up consistent models simultaneously and are operationalized automatically to forward and backward rules describing single transformation steps in the respective direction. These operational rules, however, are of fixed size and cannot describe transformatio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Algebraic & Geometric Topology

سال: 2006

ISSN: 1472-2739,1472-2747

DOI: 10.2140/agt.2006.6.171